RELIABILITY OF OPTIMAL LINEAR PROJECTION OF GROWING SCALE-FREE NETWORKS
نویسندگان
چکیده
منابع مشابه
Reliability of Optimal Linear Projection of Growing Scale-Free Networks
Singular Value Decomposition (SVD) is a technique based on linear projection theory, which has been frequently used for data analysis. It constitutes an optimal (in the sense of least squares) decomposition of a matrix in the most relevant directions of the data variance. Usually, this information is used to reduce the dimensionality of the data set in a few principal projection directions, thi...
متن کاملGrowing optimal scale-free networks via likelihood.
Preferential attachment, by which new nodes attach to existing nodes with probability proportional to the existing nodes' degree, has become the standard growth model for scale-free networks, where the asymptotic probability of a node having degree k is proportional to k^{-γ}. However, the motivation for this model is entirely ad hoc. We use exact likelihood arguments and show that the optimal ...
متن کاملSuper-star networks: Growing optimal scale-free networks via likelihood
Preferential attachment — where new nodes are added and attached to existing nodes with probability proportional to the existing nodes’ degree — has become the standard growth model for scale-free networks, where the asymptotic probability of a node having degree k is proportional to k−γ . However, the motivation for this model is entirely ad hoc. We use exact likelihood arguments and show that...
متن کاملPageRank of Scale-Free Growing Networks
PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of Web page visits by a random surfer and thus it reflects the popularity of a Web page. In the present work we find an analytical expression for the expected PageRank value in a scale free growing network model as a function of the age of the growing network and the a...
متن کاملScale-free networks with self-growing weight
We present a novel type of weighted scale-free network model, in which the weight grows independently of the attachment of new nodes. The evolution of this network is thus determined not only by the preferential attachment of new nodes to existing nodes but also by self-growing weight of existing links based on a simple weight-driven rule. This model is analytically tractable, so that the vario...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Bifurcation and Chaos
سال: 2012
ISSN: 0218-1274,1793-6551
DOI: 10.1142/s0218127412501593